Search results for "D optimal"
showing 4 items of 4 documents
Optimality results in orbit transfer
2007
Abstract The objective of this Note is to present optimality results in orbital transfer. Averaging of the energy minimization problem is considered, and properties of the associated Riemannian metric are discussed. To cite this article: B. Bonnard, J.-B. Caillau, C. R. Acad. Sci. Paris, Ser. I 345 (2007).
The path of R&D efficiency over time
2015
Abstract In this paper we investigate the pattern of R&D efficiency in terms of the number of product innovations achieved by firms over time. Using a panel dataset of Spanish manufacturing firms for the period 1990–2006, we follow the innovative performance of R&D active firms and observe that innovation rates change over firms' R&D histories. To explain these facts we propose a model that explicitly acknowledges the twofold composition of firms' R&D expenditures, comprising spending on both physical capital for R&D projects and payments to researchers. We regard this latter component of R&D as a source for dynamic returns to firms' R&D investments. Consequently firms' innovation outcomes …
A multi-agent system reinforcement learning based optimal power flow for islanded microgrids
2016
In this paper, a distributed intelligence algorithm is used to manage the optimal power flow problem in islanded microgrids. The methodology provides a suboptimal solution although the error is limited to a few percent as compared to a centralized approach. The solution algorithm is multi-agent based. According to the method, couples of agents communicate with each other only if the buses where they are located are electrically connected. The overall prizing system required for learning uses a feedback from an approximated model of the network. Based on the latter, a distributed reiforcement learning algorithm is implemented to minimize the joule losses while meeting operational constraints…
A polynomial algorithm solving a special class of hybrid optimal control problems
2006
Hybrid optimal control problems are, in general, difficult to solve. A current research goal is to isolate those problems that lead to tractable solutions [5]. In this paper, we identify a special class of hybrid optimal control problems which are easy to solve. We do this by using a paradigm borrowed from the Operations Research field. As main result, we present a solution algorithm that converges to the exact solution in polynomial time. Our approach consists in approximating the hybrid optimal control problem via an integer-linear programming reformulation. The integer-linear programming problem is a Set-covering one with a totally unimodular constraint matrix and therefore solving the S…